A complete axiomatization of timed bisimulation for a class of timed regular behaviours

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours

One of the most satisfactory results in process theory is Milner’s axiomatization of strong bisimulation for regular CCS. This result holds for open terms with finite-state recursion. Wang has shown that timed bisimulation can also be axiomatized, but only for closed terms without recursion. In this paper, we provide an axiomatization for timed bisimulation of open terms with finite-state recur...

متن کامل

Adequacy and Complete Axiomatization for Timed Modal Logic

In this paper we develop the metatheory for Timed Modal Logic (TML), which is the modal logic used for the analysis of timed transition systems (TTSs). We solve a series of long-standing open problems related to TML. Firstly, we prove that TML enjoys the Hennessy-Milner property and solve one of the open questions in the field. Secondly, we prove that the set of validities are not recursively e...

متن کامل

A Complete Inference System for a Class of Regular Behaviours

Let us think of such a tree (in which we take no account of the order among the sons of a node) as modelling the behaviour of a machine accepting symbols from, or submitting to observations by, its environment. In tree Tl only the symbol a may be accepted at the start (or, only the observation a may be made), after which b or c may be accepted. The tree is determinate, since no node has two out...

متن کامل

A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours

This paper ooers a complete inference system for branching bisimulation congruence on a basic sublanguage of CCS for representing regular processes with silent moves. Moreover, complete axiomatizations are provided for the guarded expressions in this language, representing the divergence-free processes, and for the recursion-free expressions, representing the nite processes. Furthermore it is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1995

ISSN: 0304-3975

DOI: 10.1016/0304-3975(94)00285-9